The maximum deviation just-in-time scheduling problem
نویسندگان
چکیده
منابع مشابه
The Preemptive Just-in-time Scheduling Problem in a Flow Shop Scheduling System
Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs. In this paper, just-in-time (JIT) flow shop scheduling problem with preemp...
متن کاملBi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem
This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...
متن کاملThe one-machine just-in-time scheduling problem with preemption
This paper investigates thenotion of preemption in scheduling,with earliness and tardiness penalties. Starting from the observation that the classical cost model where penalties only depend on completion times does not capture the just-in-time philosophy, we introduce a new model where the earliness costs depend on the start times of the jobs. To solve this problem, we propose an efficient repr...
متن کاملbi-objective optimization for just in time scheduling: application to the two-stage assembly flow shop problem
this paper considers a two-stage assembly flow shop problem (tafsp) where m machines are in the first stage and an assembly machine is in the second stage. the objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. jit seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...
متن کاملA Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production
In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00222-1